เข้าสู่ระบบ สมัครสมาชิก
มากกว่า

sld resolution การใช้

ประโยคมือถือ
  • Backward chaining is implemented in logic programming by SLD resolution.
  • SLDNF is an extension of SLD resolution to deal with negation as failure.
  • Examples of refutation-complete systems include : SLD resolution on Horn clauses, clause sets.
  • It has the same syntax, and the same basic concepts such as the SLD resolution algorithm.
  • The SLD resolution search space is an or-tree, in which different branches represent alternative computations.
  • Backward reasoning as in SLD resolution, which is the usual mechanism used to execute logic programs, implements regression implicitly.
  • The name " SLD resolution " was given by Maarten van Emden for the unnamed inference rule introduced by Robert Kowalski.
  • SLD resolution is non-deterministic in the sense that it does not determine the search strategy for exploring the search tree.
  • SLD resolution implicitly defines a search tree of alternative computations, in which the initial goal clause is associated with the root of the tree.
  • Kowalski, on the other hand, developed SLD resolution, a variant of SL-resolution, and showed how it treats implications as goal-reduction procedures.
  • However, the backward reasoning technique, implemented by SLD resolution, used to solve problems in logic programming languages such as Prolog, treats programs as goal-reduction procedures.
  • In fact, the resolution of a goal clause with a definite clause to produce a new goal clause is the basis of the SLD resolution inference rule, used to implement logic programming in the programming language Prolog.
  • For every node in the tree and for every definite clause in the program whose positive literal unifies with the selected literal in the goal clause associated with the node, there is a child node associated with the goal clause obtained by SLD resolution.
  • Whose positive literal ( atom ) L \, unifies with the atom L _ i \, of the selected literal \ neg L _ i \,, SLD resolution derives another goal clause, in which the selected literal is replaced by the negative literals of the input clause and the unifying substitution \ theta \, is applied: